On Extensionality of λ∗
نویسنده
چکیده
We prove an extensionality theorem for the “type-in-type” dependent type theory with Σ-types. We suggest that in type theory the notion of extensional equality be identified with the logical equivalence relation defined by induction on type structure. 1998 ACM Subject Classification F.4.1 Mathematical Logic
منابع مشابه
Comparing Approaches To Resolution Based Higher-Order Theorem Proving
We investigate several approaches to resolution based automated theorem proving in classical higher-order logic (based on Church’s simply typed λ-calculus) and discuss their requirements with respect to Henkin completeness and full extensionality. In particular we focus on Andrews’ higher-order resolution (Andrews 1971), Huet’s constrained resolution (Huet 1972), higher-order E-resolution, and ...
متن کاملFirst Class Call Stacks: Exploring Head Reduction
Weak-head normalization is inconsistent with functional extensionality in the call-by-nameλ-calculus. We explore this problem from a new angle via the conflict between extensionality and effects. Leveraging ideas from work on the λ-calculus with control, we derive and justify alternative operational semantics and a sequence of abstract machines for performing head reduction. Head reduction avoi...
متن کاملExtensional Higher-Order Paramodulation and RUE-Resolution
This paper presents two approaches to primitive equality treatment in higher-order (HO) automated theorem proving: a calculus EP adapting traditional first-order (FO) paramodulation [RW69] , and a calculus ERUE adapting FO RUE-Resolution [Dig79] to classical type theory, i.e., HO logic based on Church’s simply typed λ-calculus. EP and ERUE extend the extensional HO resolution approach ER [BK98a...
متن کاملResource Combinatory Algebras
ion of variables A useful combinator: • linear identity: I ≡ S(1)K[ ] satisfies Ix̄ = { x0 if |x̄| = 1 0 otherwise Abstraction on monomials (i) λ∗x.t ≡ Kt if degx(t) = 0 (ii) λ∗x.x ≡ Iion on monomials (i) λ∗x.t ≡ Kt if degx(t) = 0 (ii) λ∗x.x ≡ I (iii) λ∗x.t0[t1, . . . , tk] ≡ Sn̄[λ∗x.t0][λ∗x.t1, . . . , λx.tk] with n̄ = (degx(t0), . . . , degx(tk)) and ∃i. degx(ti) 6= 0. (iv) ... and on polynomials...
متن کاملA solution to Curry and Hindley's problem on combinatory strong reduction
It has often been remarked that the metatheory of strong reduction , the combinatory analogue of βη-reduction βη in λ -calculus, is rather complicated. In particular, although the confluence of is an easy consequence of βη being confluent, no direct proof of this fact is known. Curry and Hindley’s problem, dating back to 1958, asks for a self-contained proof of the confluence of , one which mak...
متن کامل